TPGF: geographic routing in wireless multimedia sensor networks

In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs. TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths. TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time. TPGF is a pure geographic greedy The work presented in this paper was supported by the Lion project supported by Science Foundation Ireland under grant no. SFI/02/CE1/I131. L. Shu ( ) · M. Hauswirth Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland e-mail: [email protected] M. Hauswirth e-mail: [email protected] Y. Zhang Simula Research Laboratory, Martin Linges v 17, Fornebu, 1325 Lysaker, Norway e-mail: [email protected] L.T. Yang St. Francis Xavier University, Antigonish, NS, Canada e-mail: [email protected] Y. Wang University of North Carolina at Charlotte, Charlotte, NC 28223, USA e-mail: [email protected] N. Xiong Georgia State University, Atlanta, GA, USA e-mail: [email protected] forwarding routing algorithm, which does not include the face routing, e.g., right/left hand rules, and does not use planarization algorithms, e.g., GG or RNG. This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms. Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs.